Problem:
 a(a(x1)) -> a(b(x1))
 a(c(x1)) -> b(x1)
 b(b(x1)) -> c(b(a(x1)))

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {3,2}
   transitions:
    b1(4) -> 5*
    a0(1) -> 2*
    b0(1) -> 3*
    c0(1) -> 1*
    1 -> 4*
    5 -> 2*
  problem:
   
  Qed